1421C - Palindromifier - CodeForces Solution

#include<iostream>
#include<cmath>
#include<vector>
#include<queue>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#define AboNasser cin.tie(nullptr); ios::sync_with_stdio(false);
using namespace std;
#define ll long long
typedef pair<int, int> pr;
typedef vector<ll> vll;
ll mod = 998244353;



void solve()
{
    ll n;
    //cin >> n;
    string s;
    cin >> s;
    n = s.size();
    cin >> s;
    cout << 4 << endl;
    cout << 'R' << ' ' << 2 << endl;
    cout << 'L' << ' ' << 2 << endl;
    cout << 'R' << ' ' << 2 << endl;
    cout << 'R' << ' ' << 4*n-5 << endl;

}




int main()
{
    AboNasser
        //	freopen("input.txt", "r", stdin);
        //freopen("output.txt", "w", stdout);

        ll t;
    //cin >> t;
    //while (t--)
        solve();
    return 0;

}
/*
abac    4n-2-2+1
abacab
babacab
babacabacaba
babacabacabab

ba
4n-2-2
*/